Replica placement to mitigate attacks on clouds

MoCFI: A Framework to Mitigate Control-Flow Attacks on Smartphones

Runtime and control-flow attacks (such as code injection or return-oriented programming) constitute one of the most severe threats to software programs. These attacks are prevalent and have been recently applied to smartphone applications as well, of which hundreds of thousands are downloaded by users every day. While a framework for control-flow integrity (CFI) enforcement, an approach to proh...

Replica Placement on Bounded Treewidth Graphs

We consider the replica placement problem: given a graph with clients and nodes, place replicas on a minimum set of nodes to serve all the clients; each client is associated with a request and maximum distance that it can travel to get served and there is a maximum limit (capacity) on the amount of request a replica can serve. The problem falls under the general framework of capacitated set cov...

Replica Placement on Directed Acyclic Graphs

The replica placement problem has been well studied on trees. In this paper, we study this problem on directed acyclic graphs. The replica placement problem on general DAGs generalizes the set cover problem. We present a constant factor approximation algorithm for the special case of DAGs having bounded degree and bounded tree-width (BDBT-DAGs). We also present a constant factor approximation a...

Topology-informed Internet replica placement

Recently, several studies have looked into the problem of replicated server placement on the Internet. Some of those studies have demonstrated that there exists a replica placement algorithm that can perform within a factor of 1.1{1.5 of the optimal solution. However, this particular greedy algorithm requires detailed knowledge about network topology, and knowledge about expected client locatio...

How to Use Information Theory to Mitigate Unfair Rating Attacks